Fixed Points of Belief Propagation—An Analysis via Polynomial Homotopy Continuation
نویسندگان
چکیده
منابع مشابه
Fixed Points of Belief Propagation - An Analysis via Polynomial Homotopy Continuation.
Belief propagation (BP) is an iterative method to perform approximate inference on arbitrary graphical models. Whether BP converges and if the solution is a unique fixed point depends on both the structure and the parametrization of the model. To understand this dependence it is interesting to find all fixed points.
متن کاملSolving polynomial systems via homotopy continuation and monodromy
We develop an algorithm to find all solutions of a generic system in a family of polynomial systems with parametric coefficients using numerical homotopy continuation and the action of the monodromy group. We argue that the expected number of homotopy paths that this algorithm needs to follow is roughly linear in the number of solutions. We demonstrate that our software implementation is compet...
متن کاملSolving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation
Polynomial systems occur in many fields of science and engineering. Polynomial homotopy continuation methods apply symbolic-numeric algorithms to solve polynomial systems. We describe the design and implementation of our web interface and reflect on the application of polynomial homotopy continuation methods to solve polynomial systems in the cloud. Via the graph isomorphism problem we organize...
متن کاملHomotopy fixed points for profinite groups emulate homotopy fixed points for discrete groups
If K is a discrete group and Z is a K-spectrum, then the homotopy fixed point spectrum Z is Map∗(EK+, Z) K , the fixed points of a familiar expression. Similarly, if G is a profinite group and X is a discrete G-spectrum, then X is often given by (HG,X), where HG,X is a certain explicit construction given by a homotopy limit in the category of discrete G-spectra. Thus, in each of two common equi...
متن کاملNumerical solution of multivariate polynomial systems by homotopy continuation methods
pn(xi,...,xn) = 0 for x = (x\,... ,xn). This problem is very common in many fields of science and engineering, such as formula construction, geometric intersection problems, inverse kinematics, power flow problems with PQ-specified bases, computation of equilibrium states, etc. Elimination theory-based methods, most notably the Buchberger algorithm (Buchberger 1985) for constructing Grobner bas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2018
ISSN: 0162-8828,2160-9292,1939-3539
DOI: 10.1109/tpami.2017.2749575